Symmetric Groups and Expander Graphs
نویسنده
چکیده
We construct explicit generating sets Sn and S̃n of the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), Sn) and C(Sym(n), S̃n) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times in the literature. These expanders have many applications in the theory of random walks on groups, card shuffling and other areas.
منابع مشابه
Highly Symmetric Expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that a...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کاملExpansion in finite simple groups of Lie type
The beautiful book of Terry Tao starts with the following words: Expander graphs are a remarkable type of graph (or more precisely, a family of graphs) on finite sets of vertices that manage to simultaneously be both sparse (low-degree) and “highly connected” at the same time. They enjoy very strong mixing properties: if one starts at a fixed vertex of an (two-sided) expander graph and randomly...
متن کامل